Convex optimization problem prototyping for image reconstruction in computed tomography with the Chambolle-Pock algorithm.
نویسندگان
چکیده
The primal-dual optimization algorithm developed in Chambolle and Pock (CP) (2011 J. Math. Imag. Vis. 40 1-26) is applied to various convex optimization problems of interest in computed tomography (CT) image reconstruction. This algorithm allows for rapid prototyping of optimization problems for the purpose of designing iterative image reconstruction algorithms for CT. The primal-dual algorithm is briefly summarized in this paper, and its potential for prototyping is demonstrated by explicitly deriving CP algorithm instances for many optimization problems relevant to CT. An example application modeling breast CT with low-intensity x-ray illumination is presented.
منابع مشابه
Sinogram constrained TV-minimization for metal artifact reduction in CT
A new method for reducing metal artifacts in X-ray computed tomography (CT) images is presented. It bases on the solution of a convex optimization problem with inequality constraints on the sinogram, and total variation regularization for the reconstructed image. The Chambolle-Pock algorithm is used to numerically solve the discretized version of the optimization problem. As proof of concept we...
متن کاملFirst-order convex feasibility algorithms for x-ray CT.
PURPOSE Iterative image reconstruction (IIR) algorithms in computed tomography (CT) are based on algorithms for solving a particular optimization problem. Design of the IIR algorithm, therefore, is aided by knowledge of the solution to the optimization problem on which it is based. Often times, however, it is impractical to achieve accurate solution to the optimization of interest, which compli...
متن کاملFaster PET reconstruction with a stochastic primal-dual hybrid gradient method
Image reconstruction in positron emission tomography (PET) is computationally challenging due to Poisson noise, constraints and potentially non-smooth priors—let alone the sheer size of the problem. An algorithm that can cope well with the first three of the aforementioned challenges is the primal-dual hybrid gradient algorithm (PDHG) studied by Chambolle and Pock in 2011. However, PDHG updates...
متن کاملApproximation and Optimization in Image Restoration and Reconstruction
We will present a convex representation for the minimal partition problem, based on the notion of “paired calibrations” [2], [3]. We propose an efficient algorithm for minimizing this problem, and discuss the practical implementation with “many” labels. It can be applied to a number of problems, from segmentation to stereo reconstruction. The quality of the results is substantially better than ...
متن کاملInertial Primal-dual Algorithms for Structured Convex Optimization
The primal-dual algorithm recently proposed by Chambolle & Pock (abbreviated as CPA) for structured convex optimization is very efficient and popular. It was shown by Chambolle & Pock in [16] and also by Shefi & Teboulle in [49] that CPA and variants are closely related to preconditioned versions of the popular alternating direction method of multipliers (abbreviated as ADM). In this paper, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physics in medicine and biology
دوره 57 10 شماره
صفحات -
تاریخ انتشار 2012